Generating Random Graphs with Tunable Clustering Coefficient
نویسندگان
چکیده
منابع مشابه
Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models. Moreover, clustering coefficient of these graphs can also be controlled. We propose a concrete flexible model from our class and provide an efficient algorith...
متن کاملCounting triangles, tunable clustering and the small-world property in random key graphs (Extended version)
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse as recommender systems, social network modeling, and clustering and classification analysis. This paper is devoted to analyzing various properties of random k...
متن کاملA model for generating tunable clustering coefficients independent of the number of nodes in scale free and random networks
Probabilistic networks display a wide range of high average clustering coefficients independent of the number of nodes in the network. In particular, the local clustering coefficient decreases with the degree of the subtending node in a complicated manner not explained by any current models. While a number of hypotheses have been proposed to explain some of these observed properties, there are ...
متن کاملRecent Progress in Complex Network Analysis: Properties of Random Intersection Graphs
Experimental results show that in large complex networks (such as internet, social or biological networks) there exists a tendency to connect elements which have a common neighbor. In theoretical random graph models, this tendency is described by the clustering coefficient being bounded away from zero. Complex networks also have power-law degree distributions and short average distances (small ...
متن کاملA Model for Generating Random Networks with Clustering Coefficient Corresponding to Real-World Network Graphs
In this paper, we propose that when a random network graph model that prefers to close two-hop chains and transform them to triangles as part of link formation. We hypothesize that such a model would generate random network graphs with high clustering coefficients and a larger variation in node degree, compared to that of the well-known Erdos-Renyi (ER) model. We refer to the proposed model as ...
متن کامل